Implications of technological changes in vehicle routing interfaces for planners’ constraint processing

نویسندگان

  • Julien CEGARRA
  • Bernat GACIAS
  • Pierre LOPEZ
چکیده

Julien CEGARRA * Bernat GACIAS Pierre LOPEZ CLLE, Université de Toulouse Centre Universitaire, Place de Verdun 81012 Albi cedex 9, FRANCE [email protected] LAAS-CNRS, Université de Toulouse 7 Avenue du Colonel Roche 31077 Toulouse cedex 4, FRANCE [email protected] [email protected] Abstract This study sought to assess the consequences of technological changes in vehicle routing interfaces for planners’ constraint processing during route selection. We began by developing a model of domain constraints for the generic vehicle routing problem, in order to characterize planners’ constraint processing and assess the visibility of constraints on different routing interfaces. An experiment featuring vehicle routing problems was then designed to test interfaces reflecting technological changes, including automation leading to simplified interfaces and the display of multiple routes computed by algorithms. Twelve participants who had worked for a small transport company for nine months were exposed to all these interfaces. Mental workload, performance and decision-making times were measured. Results revealed that automation decreases mental workload and decision times, attributable to the abridged (vs. unabridged) display of constraints on the interface. Results also showed that the perceptual (vs. analytical) display of routes greatly decreases decision times and enhances performances.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Approach to Vehicle Routing Problem: Development and Theories

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...

متن کامل

A New Mathematical Model for the Green Vehicle Routing Problem by Considering a Bi-Fuel Mixed Vehicle Fleet

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...

متن کامل

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

متن کامل

Solving a Bi-Objective Multi-Product Vehicle Routing Problem with Heterogeneous Fleets under an Uncertainty Condition

This paper presents a novel bi-objective multi-product capacitated vehicle routing problem with uncertainty in demand of retailers and volume of products (UCVRP) and heterogeneous vehicle fleets. The first of two conflict fuzzy objective functions is to minimize the cost of the used vehicles, fuel consumption for full loaded vehicles and shortage of products. The second ...

متن کامل

Comparing Two-Echelon and Single-Echelon Multi-Objective Capacitated Vehicle Routing Problems

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011